On optimality and duality for multiple-objective optimization under generalized type I univexity
نویسنده
چکیده
منابع مشابه
Sufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملOptimality and Duality for Multiple-Objective Optimization with Generalized α-Univex Functions
The aim of the present paper is to obtain a number of Kuhn-Tucker type sufficient optimality conditions for a feasible solution to be an efficient solution under the assumptions of the new notions of weak strictly pseudo quasi α-univex, strong pseudo quasi α-univex, and weak strictly pseudo α-univex vector valued functions. We also derive the duality theorems for Mond-Weir and general Mond-Wei...
متن کاملEfficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative
In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficien...
متن کاملOPTIMALITY AND DUALITY FOR MULTIOBJECTIVE FRACTIONAL PROGRAMMING PROBLEMS WITH n-SET FUNCTIONS AND GENERALIZED V -TYPE-I UNIVEXITY
Problems of multiobjective optimization are widespread in mathematical modelling of real world systems for a very broad range of applications. In particular, several classes of multiobjective problems with set and n-set functions have been the subject of several papers in the last few decades. For a historical survey of optimality conditions and duality for programming problems involving set an...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 86 شماره
صفحات -
تاریخ انتشار 2009